Temporal logic programs with variables
نویسندگان
چکیده
In this note we consider the problem of introducing variables in temporal logic programs under the formalism of Temporal Equilibrium Logic (TEL), an extension of Answer Set Programming (ASP) for dealing with linear-time modal operators. To this aim, we provide a definition of a first-order version of TEL that shares the syntax of first-order Linear-time Temporal Logic (LTL) but has a different semantics, selecting some LTL models we call temporal stable models. Then, we consider a subclass of theories (called splittable temporal logic programs) that are close to usual logic programs but allowing a restricted use of temporal operators. In this setting, we provide a syntactic definition of safe variables that suffices to show the property of domain independence – that is, addition of arbitrary elements in the universe does not vary the set of temporal stable models. Finally, we present a method for computing the derivable facts by constructing a non-temporal logic program with variables that is fed to a standard ASP grounder. The information provided by the grounder is then used to generate a subset of ground temporal rules which is equivalent to (and generally smaller than) the full program instantiation. Under consideration in Theory and Practice of Logic Programming (TPLP)
منابع مشابه
J-LO A tool for runtime-checking temporal assertions
We present a Runtime Verification framework for Java programs called the Java Logical Observer, J-LO for short. Properties can be specified in Linear-time Temporal Logic (LTL) over AspectJ pointcuts. These properties are checked during program-execution by an automaton-based approach where transitions are triggered through aspects. No Java source code is necessary since AspectJ works on the byt...
متن کاملFormal approach to guarantee the correctness of compiler optimization using temporal logic Department of Mathematical and Computing Sciences
Optimization is a very important phase of compilation. Depending on the circumstances, it can improve the performance of programs by double-digit percentages. It is essential that the compiler optimizer is implemented so that it does not change the semantics of programs it is applied to. However, many optimizations are too complex to o er such correctness. Guaranteeing the correctness of an opt...
متن کاملFrom TLT modules to stream processing functions
The objective of this note is to deene a semantics of TLT programs in terms of stream processing functions. As an intermediate step, we deene a semantics of TLT programs in terms of timed traces, which have been chosen as a common semantic framework for all speciication formalisms considered in the KorSys project. The broader intent is to explore some of the issues that will have to be addresse...
متن کاملPaving the Way for Temporal Grounding
In this paper we consider the problem of introducing variables in temporal logic programs under the formalism of Temporal Equilibrium Logic (TEL), an extension of Answer Set Programming (ASP) for dealing with linear-time modal operators. We provide several fundamental contributions that pave the way for the implementation of a grounding process, that is, a method that allows replacing variables...
متن کاملTemporal Veriication of Simulation and Reenement ?
The paper presents temporal logic methods for proving simulation and reenement relations between programs. After introducing the notions of fair transition systems and the speciication language of temporal logic, we present proof rules for verifying properties of programs. We then deene the relations of simulation and reenement between programs and relate them to inclusion relations between com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- TPLP
دوره 17 شماره
صفحات -
تاریخ انتشار 2017